Checking If There Exists a Monotonic Function That Is Consistent with the Measurements: An Efficient Algorithm
نویسندگان
چکیده
In many problems in science and engineering ranging from astrophysics to geosciences to financial analysis, we know that a physical quantity y depends on the physical quantity x, i.e., y = f(x) for some function f(x), and we want to check whether this dependence is monotonic. Specifically, finitely many measurements of xi and yi = f(xi) have been made, and we want to check whether the results of these measurements are consistent with the monotonicity of f(x). An efficient parallelizable algorithm is known for solving this problem when the values xi are known precisely, while the values yi are known with interval uncertainty. In this paper, we extend this algorithm to a more general (and more realistic) situation when both xi and yi are known with interval uncertainty. 1 Formulation of the Problem Related problems – of checking monotonicity and locating local extrema – are important. In many problems in science and engineering, we know that a physical quantity y depends on the physical quantity x, i.e., y = f(x) for some function f(x), and we want to check whether this dependence is monotonic. In spectral analysis, chemical species are identified by locating local maxima of the spectra; see, e.g., [30, 31, 32]. Thus, to identify the chemical species, we must identify intervals between local extrema, i.e., intervals of monotonicity. In radioastronomy, sources of celestial radio emission and their subcomponents are identified by locating local maxima of the measured brightness of the
منابع مشابه
A NORM INEQUALITY FOR CHEBYSHEV CENTRES
In this paper, we study the Chebyshev centres of bounded subsets of normed spaces and obtain a norm inequality for relative centres. In particular, we prove that if T is a remotal subset of an inner product space H, and F is a star-shaped set at a relative Chebyshev centre c of T with respect to F, then llx - qT (x)1I2 2 Ilx-cll2 + Ilc-qT (c) 112 x E F, where qT : F + T is any choice functi...
متن کاملA note on the problem when FS-domains coincide with RB-domains
In this paper, we introduce the notion of super finitely separating functions which gives a characterization of RB-domains. Then we prove that FS-domains and RB-domains are equivalent in some special cases by the following three claims: a dcpo is an RB-domain if and only if there exists an approximate identity for it consisting of super finitely separating functions; a consistent join-semilatti...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملCongestion estimation of router input ports in Network-on-Chip for efficient virtual allocation
Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...
متن کاملModeling heat transfer of non-Newtonian nanofluids using hybrid ANN-Metaheuristic optimization algorithm
An optimal artificial neural network (ANN) has been developed to predict the Nusselt number of non-Newtonian nanofluids. The resulting ANN is a multi-layer perceptron with two hidden layers consisting of six and nine neurons, respectively. The tangent sigmoid transfer function is the best for both hidden layers and the linear transfer function is the best transfer function for the output layer....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reliable Computing
دوره 11 شماره
صفحات -
تاریخ انتشار 2005